Finding Epitopes with Computers

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Machine-learning methods for finding HIV epitopes

Current thinking among HIV-vaccine researchers is that HIV vaccines must prime the cellular immune response rather than or in addition to the humoral response in order to be successful. At the core of the cellular response is the ability of cells to ingest and digest viral proteins into smaller peptides, and then to present these peptides, known as epitopes, at the surface of the cell. This pro...

متن کامل

Finding error-correcting codes using computers

The theory of error-correcting codes is a vast and fast-moving area with many open problems. The objective of this paper is to survey where the current boundaries of knowledge are in a few selected areas, by listing the smallest unsolved cases. Our hope is that these lists will motivate further computational to move these boundaries.

متن کامل

Posters: Computers Everywhere: Finding Objects in “Strata Drawer”

Looking for a document in a stack of papers is a difficult job. If the “strata” of the drawer contents is known, then locating will be much easier. Strata Drawer is a camera-enhanced cabinet used for storage. This cabinet has a single, deep drawer equipped with a camera, a depth-sensor and a computer. When a user places an object in the drawer and closes it, a photograph is automatically taken,...

متن کامل

Route Finding in Street Maps by Computers and People

We wrote a computer program which gives driving directions in northern New Jersey. Its data base combines a street map and a telephone book, so requests like “give directions from the Lackawanna Diner to the nearest dry cleaner’* (properly specified) can be answered. This problem involves both human factors and algorithmic problems. From the human factors standpoint, what kind of route is best:...

متن کامل

Quantum Computers and Unstructured Search: Finding and Counting Items with an Arbitrarily Entangled Initial State

Grover’s quantum algorithm for an unstructured search problem and the Count algorithm by Brassard et al. are generalized to the case when the initial state is arbitrarily and maximally entangled. This ansatz might be relevant with quantum subroutines, when the computational qubits and the environment are coupled, and in general when the control over the quantum system is partial.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chemistry & Biology

سال: 2013

ISSN: 1074-5521

DOI: 10.1016/j.chembiol.2013.10.002